An Incorrect Index Search Method for C++ String Accesses
نویسندگان
چکیده
منابع مشابه
An Efficient Index Structure for String Databases
We consider the problem of substring searching in large databases. Typical applications of this problem are genetic data, web data, and event sequences. Since the size of such databases grows exponentially, it becomes impractical to use inmemory algorithms for these problems. In this paper, we propose to map the substrings of the data into an integer space with the help of wavelet coefficients....
متن کاملAn Interactive Search Technique for String Databases
The explosive growth of string databases makes similarity search a challenging problem. Current search tools are non-interactive in the sense that the user has to wait a long time until the entire database is inspected. We consider the problem of interactive searching, and propose a set of innovative -NN ( -Nearest Neighbor) search algorithms. We propose a new model for the distance distributio...
متن کاملB-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance
Strings are ubiquitous in computer systems and hence string processing has attracted extensive research effort from computer scientists in diverse areas. One of the most important problems in string processing is to efficiently evaluate the similarity between two strings based on a specified similarity measure. String similarity search is a fundamental problem in information retrieval, database...
متن کاملsiEDM: an efficient string index and search algorithm for edit distance with moves
Although several self-indexes for highly repetitive text collections exist, developing an index and search algorithm with editing operations remains a challenge. Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string into another. Although the problem of computing EDM is intractable, it has...
متن کاملA climbing string method for saddle point search.
The string method originally proposed for the computation of minimum energy paths (MEPs) is modified to find saddle points around a given minimum on a potential energy landscape using the location of this minimum as only input. In the modified method the string is evolved by gradient flow in path space, with one of its end points fixed at the minimum and the other end point (the climbing image)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science and Education of the Bauman MSTU
سال: 2016
ISSN: 1994-0408
DOI: 10.7463/0516.0840726